View Updates in Disjunctive Deductive Databases Based on SLD-Resolution

View update problem in deductive databases is concerned with the translation of an update of an intensional relation by modifying the underlying relations of the extensional part of the database. In the existing algorithms for view updates of a deductive database, a sound and complete proof procedure is usually employed to generate explanations for the atom to be inserted or deleted. In the case of deenite datalog databases, algorithms based on SLD-tree have been proposed. View updates for disjunctive deductive databases have been rst discussed by Minker and his co-workers. However to beneet from SLD-tree, problems are restricted to disjunctive deductive databases in which the intensional database is a Horn program. Further they extended their algorithms to general disjunctive deductive databases, however, SLD-resolution is replaced by more complicated SLI-resolution. In this paper we deal with view updates in disjunctive deductive database based on a program transformation and show how the problem can be solved in a framework based on SLD-resolution.